8.1 KB · ⇊ 6 parts · ⤓ Micron 8.1 KB · ⤓ HTML 33.5 KB

top

Daniel Dominic Kaplan Sleator (born 10 December 1953) is a professor of computer science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure.cite-ref-2[2]

He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic,cite-ref-mtf-3-0[3] and splay trees.cite-ref-splay-4-0[4] He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps.

The Sleator and Tarjan paper on the move-to-front heuristiccite-ref-mtf-3-1[3] first suggested the idea of comparing an online algorithm to an optimal offline algorithm, for which the term competitive analysis was later coined in a paper of Karlin, Manasse, Rudolph, and Sleator.cite-ref-snoopy-5-0[5] Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music.

• Personal life

• References

• External links

Sleator was born to William Warner Sleator, Jr., a professor of physiology and biophysics, and Esther Kaplan Sleator, a pediatrician who did pioneering research on attention deficit disorder (ADD).cite-ref-nytobit-6-0[6] He is the younger brother of William Sleator, who wrote science fiction for young adults.

Sleator commercialized the volunteer-based Internet Chess Server into the Internet Chess Club despite outcry from fellow volunteers. The ICS has since become one of the most successful internet-based commercial chess servers.

From 2003 to 2008, Sleator co-hosted the progressive talk show Left Out on WRCT-FM with Carnegie Mellon University School of Computer Science faculty member Bob Harper.

He is also an active member of the competitive programming platform Codeforces.cite-ref-7[7]

cite-note-11. American Men and Women of Science, Thomson Gale, 2004

cite-note-22. ↑ Citation for Sleator and Tarjan Kanellakis Award Archived 2012-02-11 at the Wayback Machine

cite-note-mtf-33. ↑ citerefsleatortarjan1985Sleator, Daniel D.; Tarjan, Robert E. (1985), "Amortized efficiency of list update and paging rules" (PDF), Communications of the ACM, 28 (2): 202–208, CiteSeerX 10.1.1.367.6317, doi:10.1145/2786.2793, S2CID 2494305

cite-note-splay-44. ↑ citerefsleatortarjan1985Sleator, Daniel D.; Tarjan, Robert E. (1985), "Self-Adjusting Binary Search Trees" (PDF), Journal of the ACM, 32 (3): 652–686, doi:10.1145/3828.3835, S2CID 1165848

cite-note-snoopy-55. ↑ citerefkarlinmanasserudolphsleator1988Karlin, Anna R.; Manasse, Mark S.; Rudolph, Larry; Sleator, Daniel D. (1988), "Competitive snoopy caching", Algorithmica, 3 (1): 79–119, doi:10.1007/BF01762111, MR 0925479, S2CID 33446072

cite-note-nytobit-66. ↑ citereffox2011Fox, Margalit (August 6, 2011). "William Sleator, Fantasy Writer for Young Adults, Dies at 66". The New York Times. Retrieved 2011-08-07.

cite-note-77. ↑ "Darooha". Codeforces. Retrieved 2020-04-13.

• The CMU home page of Daniel Sleator

• The Internet Chess Club

• Paris Kanellakis Theory and Practice Award

• Left Out radio show